846B - Math Show - CodeForces Solution

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        int n, k, m;
        cin >> n >> k >> m;
        vector<int> v(k+5);
        for (int i = 1; i <= k; i++) cin >> v[i];
        int ans = 0;
        sort(v.begin() + 1, v.begin() + k + 1);
        for (int i = 0; i <= n; i++) {
                int res = 0;
                for (int j = 1; j <= k; j++) res += i*v[j];
                if (res > m) break;
                int cur = i*(k + 1);
                int sisa = m - res;
                for (int j = 1; j <= k; j++) {
                        if (v[j]*(n - i) <= sisa) {
                                sisa -= v[j]*(n - i);
                                cur += n - i;
                        } else {
                                cur += sisa/v[j];
                                break;
                        }
                }
                ans = max(ans, cur);
        }
        cout << ans << '\n';
        return 0;
}